Mining for Stable Patterns: Regular Intervals between Occurrences

نویسندگان

  • Edgar de Graaf
  • Walter A. Kosters
چکیده

We propose a new measure of support (the number of occurrences of a pattern in a dataset), where we count the number of times a pattern occurs (nearly) in the middle between two other occurrences. The more a pattern occurs in the middle of two occurrences (transaction wise) the more stable or regular the interval between occurrences is. We will define this measure and show how it can be implemented in Eclat in order to mine for frequent patterns. Our goal is to find all patterns that occur with some fixed interval, e.g., a certain phone-call occurs almost every Friday.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Estimation of reliability-based maintenance time intervals of Load-Haul-Dumper in an underground coal mine

Reliability estimation plays a significant role in the performance assessment of mining equipment, and aids in designing efficient and effective preventive maintenance strategies. Continuous and random/irregular occurrence of failures in a system could be the main cause for performance drop of machinery. The accomplishment of a projected level of production is possible only by an efficient oper...

متن کامل

Proposing an approach to calculate headway intervals to improve bus fleet scheduling using a data mining algorithm

The growth of AVL (Automatic Vehicle Location) systems leads to huge amount of data about different parts of bus fleet (buses, stations, passenger, etc.) which is very useful to improve bus fleet efficiency. In addition, by processing fleet and passengers’ historical data it is possible to detect passenger’s behavioral patterns in different parts of the day and to use it in order to improve fle...

متن کامل

MaRFI: Maximal Regular Frequent Itemset Mining using a pair of Transaction-ids

Frequent pattern mining is the fundamental and most dominant research area in data mining. Maximal frequent patterns are one of the compact representations of frequent itemsets. There is more number of algorithms to find maximal frequent patterns that are suitable for mining transactional databases. Users not only interested in occurrence frequency but may be interested on frequent patterns tha...

متن کامل

Modeling localized bearing faults using inverse Gaussian mixtures

Localized bearing faults exhibit specific repetitive vibrational patterns. Due to the constant angular distance between the roller elements, the vibrational patterns occur on regular angular intervals. Under constant operating conditions such patterns become easily detectable as “periodic” events. Slippage or small variation in rotational speed are commonly modeled by introducing normally distr...

متن کامل

Mining First-Order Temporal Interval Patterns with Regular Expression Constraints

Most methods for temporal pattern mining assume that time is represented by points in a straight line starting at some initial instant. In this paper, we consider a new kind of first order temporal pattern, specified in Allen’s Temporal Interval Logic, where time is explicitly represented by intervals. We present the algorithm MILPRIT for mining temporal interval patterns, which uses variants o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006